Multiprocessor Interconnection Networks
نویسنده
چکیده
A deadlock-free routing algorithm can be generated for arbitrary interconnection networks using the concept of virtual channels. A necessary and sufficient condition for deadlock-free routing is the absence of cycles in a channel dependency graph. Given an arbitrary network and a routing function, the cycles of the channel dependency graph can be removed by splitting physical channels into groups of virtual channels. This method is used to develop deadlock-free routing algorithms for k-ary n-cubes, for cube-connected cycles, and for shuffle-exchange networks.
منابع مشابه
Performance Analysis of a New Neural Network for Routing in Mesh Interconnection Networks
Routing is one of the basic parts of a message passing multiprocessor system. The routing procedure has a great impact on the efficiency of a system. Neural algorithms that are currently in use for computer networks require a large number of neurons. If a specific topology of a multiprocessor network is considered, the number of neurons can be reduced. In this paper a new recurrent neural ne...
متن کاملPerformance Analysis of a New Neural Network for Routing in Mesh Interconnection Networks
Routing is one of the basic parts of a message passing multiprocessor system. The routing procedure has a great impact on the efficiency of a system. Neural algorithms that are currently in use for computer networks require a large number of neurons. If a specific topology of a multiprocessor network is considered, the number of neurons can be reduced. In this paper a new recurrent neural ne...
متن کاملGraphs for small multiprocessor interconnection networks
Let D be the diameter of a graph G and let λ1 be the largest eigenvalue of its (0,1)adjacency matrix. We give a proof of the fact that there are exactly 69 non-trivial connected graphs with (D + 1)λ1 9. These 69 graphs all have up to 10 vertices and were recently found to be suitable models for small multiprocessor interconnection networks. We also examine the suitability of integral graphs to ...
متن کاملMathematical Model of Energy Consumption of A Hierarchical Shared Bus Interconnection Communication Network of an On-Chip Multiprocessor
Energy consumption is one of the performance issues in multiprocessor design. Apart from being critical for power critical systems, it determines the amount of heat dissipates by the system. That is, as the energy consumption rate reduces heat dissipation reduces. Many research efforts had gone into the different design schemes for reducing multiprocessors’ energy consumption. However, it has b...
متن کاملReliable Flow Control Coding in Low-Buffer Grid Networks
We consider a grid network where nodes contain small buffers. A packet that faces a crowded buffer in its route will get extra latency and may be dropped. In this paper, we propose a novel flow control protocol called RFCC for grid networks. RFCC tries to reroute delayed packets and utilizes network coding to introduce a configurable amount of redundant information in the network, thereby incre...
متن کاملMINSimulate – A MULTISTAGE INTERCONNECTION NETWORK SIMULATOR
Multistage interconnection networks are frequently proposed as connections in multiprocessor systems or network switches. In this paper, a new tool for stochastic simulation of such networks is presented. Simple crossbars can be simulated as well as multistage interconnection networks that are arranged in multiple layers.
متن کامل